#include<bits/stdc++.h>
using namespace std;
#define M 100005
int n,now;
int a[M],b[M],cnt=1;
int main(){
    freopen("duel4.in","r",stdin);
    freopen("duel.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;i++) scanf("%d",&a[i]);
    sort(a+1,a+n+1);
    b[1]=1;
    for(int i=2;i<=n;i++) {
        if(a[i]==a[i-1]) b[cnt]++;
        else b[++cnt]++;
    }
    for(int i=1;i<=cnt;i++) now=max(now,b[i]);
    cout<<now;
    return 0;
}
